Fast bidirectional shortest path on GPU
نویسندگان
چکیده
منابع مشابه
Fast bidirectional shortest path on GPU
The bidirectional shortest path problem has important applications in VLSI floor planning and other areas. We introduce a new algorithm to solve bidirectional shortest path problems using parallel architectures provided by general purpose computing on graphics processing units. The algorithm performs parallel searches from the source and sink using Dijkstra’s classic approach modified with prun...
متن کاملShortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures
We develop an efficient parallel algorithm for answering shortestpath queries in planar graphs and implement it on a multi-node CPU/GPU clusters. The algorithm uses a divide-and-conquer approach for decomposing the input graph into small and roughly equal subgraphs and constructs a distributed data structure containing shortest distances within each of those subgraphs and between their boundary...
متن کاملA New GPU-based Approach to the Shortest Path Problem
The Single-Source Shortest Path (SSSP) problem arises in many different fields. In this paper we present a GPUbased version of the Crauser et al. SSSP algorithm. Our work significantly speeds up the computation of the SSSP, not only with respect to the CPU-based version, but also to other state-ofthe-art GPU implementation based on Dijkstra, due to Martı́n et al. Both GPU implementations have be...
متن کاملCombinatorial Bidirectional Path-Tracing for Efficient Hybrid CPU/GPU Rendering
This paper presents a reformulation of bidirectional path-tracing that adequately divides the algorithm into processes efficiently executed in parallel on both the CPU and the GPU. We thus benefit from high-level optimization techniques such as double buffering, batch processing, and asyncronous execution, as well as from the exploitation of most of the CPU, GPU, and memory bus capabilities. Ou...
متن کاملA Parallel Recursive Approach for Solving All Pairs Shortest Path Problem on GPU using OpenCL
All-pairs shortest path problem(APSP) finds a large number of practical applications in real world. We owe to present a highly parallel and recursive solution for solving APSP problem based on Kleene’s algorithm. The proposed parallel approach for APSP is implemented using an open standard framework OpenCL which provides a development environment for utilizing massive parallel capabilities of M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2016
ISSN: 1349-2543
DOI: 10.1587/elex.13.20160036